ASYMPTOTIC APPROXIMATION METHOD AND ITS CONVERGENCE ON SEMI-INFINITE PROGRAMMING
نویسندگان
چکیده
منابع مشابه
Discretization in Semi-Infinite Programming: The rate of approximation
The discretization approach for solving semi-infinite optimization problems is considered. We are interested in the rate of the approximation error between the solution of the semi-infinite problem and the solution of the discretized program depending on the discretization mesh-size d. It will be shown how this rate depends on whether the minimizer is strict of order one or two and on whether t...
متن کاملOn affine scaling and semi-infinite programming
In this note we are concerned with the generalization given by Ferris and Philpott [3] of the affine scaling algorithm discovered by Dikin [2] to solve semi-infinite linear programming problems, in which the number of variables is finite, but the number of constraints is not. In [3] a discrepancy is pointed out between the classical algorithm and its generalization. The purpose of this note is ...
متن کاملSemi-infinite programming
A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The paper, which intends to make a compromise between an introduction and a survey, treats the theoretical basis, numerical methods, ...
متن کاملNon-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation
In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.
متن کاملBranch-and-Bound Reduction Type Method for Semi-Infinite Programming
Semi-infinite programming (SIP) problems can be efficiently solved by reduction type methods. Here, we present a new reduction method for SIP, where the multi-local optimization is carried out with a multi-local branch-and-bound method, the reduced (finite) problem is approximately solved by an interior point method, and the global convergence is promoted through a two-dimensional filter line s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Scientia
سال: 2006
ISSN: 0252-9602
DOI: 10.1016/s0252-9602(06)60022-2